Block size in Geometric($p$)-biased permutations
نویسندگان
چکیده
منابع مشابه
Rapid Mixing of k-Class Biased Permutations
In this paper, we study a biased version of the nearest-neighbor transposition Markov chain on the set of permutations where neighboring elements i and j are placed in order (i, j) with probability pi,j . Our goal is to identify the class of parameter sets P = {pi,j} for which this Markov chain is rapidly mixing. Specifically, we consider the open conjecture of Jim Fill that all monotone, posit...
متن کاملMixing of Permutations by Biased Transposition
Markov chains defined on the set of permutations of 1, 2, . . . , n have been studied widely by mathematicians and theoretical computer scientists [15, 4, 1]. We consider chains in which a position i < n is chosen uniformly at random, and then σ(i) and σ(i+1) are swapped with probability depending on σ(i) and σ(i+1). Our objective is to identify some conditions that assure rapid mixing. One cas...
متن کاملPermutations on the Block PRAM
Chin, A., Permutations on the Block PRAM, Information Processing Letters 45 (1993) 69-73. In present-day parallel computers, the complexity of permuting N data items in shared memory varies, depending on whether large blocks can be used for communication. The Block PRAM model of Aggarwal, Chandra and Snir is unique among shared-memory models of parallel computation in modeling this phenomenon. ...
متن کاملThe Hopf Algebra of Uniform Block Permutations
We introduce the Hopf algebra of uniform block permutations and show that it is self-dual, free, and cofree. These results are closely related to the fact that uniform block permutations form a factorizable inverse monoid. This Hopf algebra contains the Hopf algebra of permutations of Malvenuto and Reutenauer and the Hopf algebra of symmetric functions in non-commuting variables of Gebhard, Ros...
متن کاملMixing Times of the Schelling Segregation Model and Biased Permutations
Markov chains are fundamental tools used throughout the sciences and engineering; the design and analysis of Markov Chains has been a focus of theoretical computer science for the last 20 years. A Markov Chain takes a random walk in a large state space Ω, converging to a target stationary distribution π over Ω. The number of steps needed for the random walk to have distribution close to π is th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Communications in Probability
سال: 2018
ISSN: 1083-589X
DOI: 10.1214/18-ecp182